|
|
Gene Searching - Web Application
Stiborová, Lucie ; Koutný, Jiří (referee) ; Burgetová, Ivana (advisor)
The aim of my Bachelor's Thesis is to create a user interface and to implement the web application with the genes' searching. This is the educational application when each user has a possibility of entering own nucleotide sequences or selecting a redefined chain. This application has to be able to read, process and decide on the existence of a potential gene. On the base of this simple statistic method the result is given back to the user.
|
|
| |
|
| |
|
|
Hardware Acceleration of Algorithms for Approximate String Matching
Nosek, Ondřej ; Kořenek, Jan (referee) ; Martínek, Tomáš (advisor)
Methods for aproximate string matching of various sequences used in bioinformatics are crucial part of development in this branch. Tasks are of very large time complexity and therefore we want create a hardware platform for acceleration of these computations. Goal of this work is to design a generalized architecture based on FPGA technology, which can work with various types of sequences. Designed acceleration card will use especially dynamic algorithms like Needleman-Wunsch and Smith-Waterman.
|
|
|
Synthesis of proteins containing non-canonical amino acids
Knetl, Adam ; Vopálenský, Václav (advisor) ; Plocek, Vítězslav (referee)
0 Abstract: Non-canonical amino acids allow the introduction of new chemical properties into proteins, which is useful both for studying proteins, and designing proteins. However, the synthesis of proteins containing non-canonical amino acids faces problems with decreased effectivity of translation. This thesis examines the role of genetic code for coding non-canonical amino acids, proteosynthesis and aminoacilation of tRNA and finally the non-canonical amino acids and their application in proteins while including examples.
|
|
| |
|
| |
|
|
Gene Searching - Web Application
Stiborová, Lucie ; Koutný, Jiří (referee) ; Burgetová, Ivana (advisor)
The aim of my Bachelor's Thesis is to create a user interface and to implement the web application with the genes' searching. This is the educational application when each user has a possibility of entering own nucleotide sequences or selecting a redefined chain. This application has to be able to read, process and decide on the existence of a potential gene. On the base of this simple statistic method the result is given back to the user.
|
|
|
Hardware Acceleration of Algorithms for Approximate String Matching
Nosek, Ondřej ; Kořenek, Jan (referee) ; Martínek, Tomáš (advisor)
Methods for aproximate string matching of various sequences used in bioinformatics are crucial part of development in this branch. Tasks are of very large time complexity and therefore we want create a hardware platform for acceleration of these computations. Goal of this work is to design a generalized architecture based on FPGA technology, which can work with various types of sequences. Designed acceleration card will use especially dynamic algorithms like Needleman-Wunsch and Smith-Waterman.
|
guest ::
